An Optimal Algorithm for Building the Majority Rule Consensus Tree
نویسندگان
چکیده
A deterministic algorithm for building the majority rule consensus tree of an input collection of conflicting phylogenetic trees with identical leaf labels is presented. Its worst-case running time is O(nk), where n is the size of the leaf label set and k is the number of input phylogenetic trees. This is optimal since the input size is Ω(nk). Experimental results show that the algorithm is fast in practice.
منابع مشابه
Algorithms for Building Consensus MUL-trees
A MUL-tree is a generalization of a phylogenetic tree that allows the same leaf label to be used many times. Lott et al. [9,10] recently introduced the problem of inferring a so-called consensus MUL-tree from a set of conflicting MUL-trees and gave an exponential-time algorithm for a special greedy variant. Here, we study strict and majority rule consensus MUL-trees, and present the first ever ...
متن کاملPolynomial-Time Algorithms for Building a Consensus MUL-Tree
A multi-labeled phylogenetic tree, or MUL-tree, is a generalization of a phylogenetic tree that allows each leaf label to be used many times. MUL-trees have applications in biogeography, the study of host-parasite cospeciation, gene evolution studies, and computer science. Here, we consider the problem of inferring a consensus MUL-tree that summarizes a given set of conflicting MUL-trees, and p...
متن کاملVoltage Sag Compensation with DVR in Power Distribution System Based on Improved Cuckoo Search Tree-Fuzzy Rule Based Classifier Algorithm
A new technique presents to improve the performance of dynamic voltage restorer (DVR) for voltage sag mitigation. This control scheme is based on cuckoo search algorithm with tree fuzzy rule based classifier (CSA-TFRC). CSA is used for optimizing the output of TFRC so the classification output of the network is enhanced. While, the combination of cuckoo search algorithm, fuzzy and decision tree...
متن کاملProperties of consensus methods for inferring species trees from gene trees.
Consensus methods provide a useful strategy for summarizing information from a collection of gene trees. An important application of consensus methods is to combine gene trees to estimate a species tree. To investigate the theoretical properties of consensus trees that would be obtained from large numbers of loci evolving according to a basic evolutionary model, we construct consensus trees fro...
متن کاملA justification for reporting the majority-rule consensus tree in Bayesian phylogenetics.
Systematists must frequently deal with substantial uncertainty in their phylogenetic estimates. Nonparametric bootstrapping (59) and Markov chain Monte Carlo (MCMC) simulations used for Bayesian phylogenetic inference (65; 64; 60) are two of the most popular computational approaches for assessing support for different parts of a phylogenetic tree. Both of these techniques produce large collecti...
متن کامل